The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(2^n, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

plus(0, x) → x
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(x), y) → plus(y, times(x, y))
exp(x, 0) → s(0)
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0) → true
ge(0, s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0, x, y, s(0))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(2ⁿ):
The rewrite sequence
exp(s(x19013_1), s(y)) →⁺ plus(exp(s(x19013_1), y), times(x19013_1, exp(s(x19013_1), y)))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [y / s(y)].
The result substitution is [ ].

The rewrite sequence
exp(s(x19013_1), s(y)) →⁺ plus(exp(s(x19013_1), y), times(x19013_1, exp(s(x19013_1), y)))
gives rise to a decreasing loop by considering the right hand sides subterm at position [1,1].
The pumping substitution is [y / s(y)].
The result substitution is [ ].

(2) BOUNDS(2^n, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
plus, times, exp, ge, towerIter

They will be analysed ascendingly in the following order:
plus < times
times < exp
exp < towerIter
ge < towerIter

(8) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
plus, times, exp, ge, towerIter

They will be analysed ascendingly in the following order:
plus < times
times < exp
exp < towerIter
ge < towerIter

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

Induction Base:
plus(gen_0':s3_0(0), gen_0':s3_0(b)) →_R^Ω(1)
gen_0':s3_0(b)

Induction Step:
plus(gen_0':s3_0(+(n5_0, 1)), gen_0':s3_0(b)) →_R^Ω(1)
s(plus(gen_0':s3_0(n5_0), gen_0':s3_0(b))) →_IH
s(gen_0':s3_0(+(b, c6_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
times, exp, ge, towerIter

They will be analysed ascendingly in the following order:
times < exp
exp < towerIter
ge < towerIter

(12) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)

Induction Base:
times(gen_0':s3_0(0), gen_0':s3_0(b)) →_R^Ω(1)
0'

Induction Step:
times(gen_0':s3_0(+(n566_0, 1)), gen_0':s3_0(b)) →_R^Ω(1)
plus(gen_0':s3_0(b), times(gen_0':s3_0(n566_0), gen_0':s3_0(b))) →_IH
plus(gen_0':s3_0(b), gen_0':s3_0(*(c567_0, b))) →_L^{Ω(1 + b)}
gen_0':s3_0(+(b, *(n566_0, b)))

We have rt ∈ Ω(n²) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n²).

(13) Complex Obligation (BEST)

(14) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
exp, ge, towerIter

They will be analysed ascendingly in the following order:
exp < towerIter
ge < towerIter

(15) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
exp(gen_0':s3_0(a), gen_0':s3_0(+(1, n1278_0))) → *4_0, rt ∈ Ω(n1278₀)

Induction Base:
exp(gen_0':s3_0(a), gen_0':s3_0(+(1, 0)))

Induction Step:
exp(gen_0':s3_0(a), gen_0':s3_0(+(1, +(n1278_0, 1)))) →_R^Ω(1)
times(gen_0':s3_0(a), exp(gen_0':s3_0(a), gen_0':s3_0(+(1, n1278_0)))) →_IH
times(gen_0':s3_0(a), *4_0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(16) Complex Obligation (BEST)

(17) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)
exp(gen_0':s3_0(a), gen_0':s3_0(+(1, n1278_0))) → *4_0, rt ∈ Ω(n1278₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
ge, towerIter

They will be analysed ascendingly in the following order:
ge < towerIter

(18) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
ge(gen_0':s3_0(n5212_0), gen_0':s3_0(n5212_0)) → true, rt ∈ Ω(1 + n5212₀)

Induction Base:
ge(gen_0':s3_0(0), gen_0':s3_0(0)) →_R^Ω(1)
true

Induction Step:
ge(gen_0':s3_0(+(n5212_0, 1)), gen_0':s3_0(+(n5212_0, 1))) →_R^Ω(1)
ge(gen_0':s3_0(n5212_0), gen_0':s3_0(n5212_0)) →_IH
true

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(19) Complex Obligation (BEST)

(20) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)
exp(gen_0':s3_0(a), gen_0':s3_0(+(1, n1278_0))) → *4_0, rt ∈ Ω(n1278₀)
ge(gen_0':s3_0(n5212_0), gen_0':s3_0(n5212_0)) → true, rt ∈ Ω(1 + n5212₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
towerIter

(21) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol towerIter.

(22) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)
exp(gen_0':s3_0(a), gen_0':s3_0(+(1, n1278_0))) → *4_0, rt ∈ Ω(n1278₀)
ge(gen_0':s3_0(n5212_0), gen_0':s3_0(n5212_0)) → true, rt ∈ Ω(1 + n5212₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(23) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)

(24) BOUNDS(n^2, INF)

(25) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)
exp(gen_0':s3_0(a), gen_0':s3_0(+(1, n1278_0))) → *4_0, rt ∈ Ω(n1278₀)
ge(gen_0':s3_0(n5212_0), gen_0':s3_0(n5212_0)) → true, rt ∈ Ω(1 + n5212₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(26) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)

(27) BOUNDS(n^2, INF)

(28) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)
exp(gen_0':s3_0(a), gen_0':s3_0(+(1, n1278_0))) → *4_0, rt ∈ Ω(n1278₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(29) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)

(30) BOUNDS(n^2, INF)

(31) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(32) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s3_0(n566_0), gen_0':s3_0(b)) → gen_0':s3_0(*(n566_0, b)), rt ∈ Ω(1 + b·n566₀ + n566₀)

(33) BOUNDS(n^2, INF)

(34) Obligation:

TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(x, y))
exp(x, 0') → s(0')
exp(x, s(y)) → times(x, exp(x, y))
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
tower(x, y) → towerIter(0', x, y, s(0'))
towerIter(c, x, y, z) → help(ge(c, x), c, x, y, z)
help(true, c, x, y, z) → z
help(false, c, x, y, z) → towerIter(s(c), x, y, exp(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
exp :: 0':s → 0':s → 0':s
ge :: 0':s → 0':s → true:false
true :: true:false
false :: true:false
tower :: 0':s → 0':s → 0':s
towerIter :: 0':s → 0':s → 0':s → 0':s → 0':s
help :: true:false → 0':s → 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
hole_true:false2_0 :: true:false
gen_0':s3_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(35) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s3_0(n5_0), gen_0':s3_0(b)) → gen_0':s3_0(+(n5_0, b)), rt ∈ Ω(1 + n5₀)

(36) BOUNDS(n^1, INF)